منابع مشابه
Local Ordinal Classification
Given ordered classes, one is not only concerned to maximize the classification accuracy, but also to minimize the distances between the actual and the predicted classes. This paper offers an organized study on the various methodologies that have tried to handle this problem and presents an experimental study of these methodologies with the proposed local ordinal technique, which locally conver...
متن کاملClassification of Ordinal Data
Predictive learning has traditionally been a standard inductive learning, where different subproblem formulations have been identified. One of the most representative is classification, consisting on the estimation of a mapping from the feature space into a finite class space. Depending on the cardinality of the finite class space we are left with binary or multiclass classification problems. F...
متن کاملOrdinal Classification with Decision Rules
We consider the problem of ordinal classification, in which a value set of the decision attribute (output, dependent variable) is finite and ordered. This problem shares some characteristics of multi-class classification and regression, however, in contrast to the former, the order between class labels cannot be neglected, and, in the contrast to the latter, the scale of the decision attribute ...
متن کاملA Classification of Ordinal Topologies
Ordinals carry a natural topology induced by their linear order. In this note, we classify the homeomorphism types of all ordinal topologies using the Cantor normal form and the notion of the Cantor–Bendixson rank of a point. Let < be a linear order on a set X. The order topology on X is generated by the subbase of rays of the form leftX(b) := {x ∈ X : x < b} and rightX(a) := {x ∈ X : a < x} fo...
متن کاملNoncrossing Trees and Noncrossing Graphs
Abstract. We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of Panholzer and Prodinger for noncrossing trees and find a correspondence between a class of noncrossing trees, called proper noncrossing trees, and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Its Interface
سال: 2017
ISSN: 1938-7989,1938-7997
DOI: 10.4310/sii.2017.v10.n2.a3